Complexity and Applications of Edge-Induced Vertex-Cuts
نویسندگان
چکیده
Motivated by hypergraph decomposition algorithms, we introduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We investigate the complexity of computing minimum edge-induced vertex-cuts and demonstrate the usefulness of our notion by applications in network reliability and constraint satisfaction.
منابع مشابه
ar X iv : c s / 06 07 10 9 v 1 [ cs . D M ] 2 5 Ju l 2 00 6 Complexity and Applications of Edge - Induced Vertex - Cuts
Motivated by hypergraph decomposition algorithms, we introduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We investigate the complexity of computing minimum edge-induced vertex-cuts and demonstrate the usefulness of our notion by applications in network reliability and constraint satisfaction.
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کامل5 Further Studies
Kotzig, A. S uvislost' a pravidelnn a s uvislost' kone cn yh grafov. maintenance of the four-connected components of a graph. Proc. A fast algorithm for optimally increasing the edge-connectivity. Figure 9: A 4-edge-connected graph and 3-edge{cuts in its 3-vertex-components for incremental maintenance of this structure is suggested. No general l-cuts description, l k + 1, is known. To item 4. T...
متن کاملEdge-Szeged and vertex-PIindices of Some Benzenoid Systems
The edge version of Szeged index and vertex version of PI index are defined very recently. They are similar to edge-PI and vertex-Szeged indices, respectively. The different versions of Szeged and PIindices are the most important topological indices defined in Chemistry. In this paper, we compute the edge-Szeged and vertex-PIindices of some important classes of benzenoid systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0607109 شماره
صفحات -
تاریخ انتشار 2006